On maximum Wiener index of directed grids

Wiener Index Versus Maximum Degree in

Wiener index versus maximum degree in trees

The Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. In this paper we characterize the trees which minimize the Wiener index among all trees of given order and maximum degree and the trees which maximize the Wiener index among all trees of given order that have only vertices of two di erent degrees.

Maximizing Wiener index of graphs with fixed maximum degree

The Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. Fischermann et al [5] characterized the trees which minimize the Wiener index among all trees with the maximum degree at most ∆. They also determined the trees which maximize the Wiener index, but in a much more restricted family of trees which have two distinct vertex degrees only. In this note, we fully...

The Maximum Wiener Index of Trees with Given Degree Sequences

The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang in [23] gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum Wiener index of trees with given degree sequences and extremal trees which attain the maximum value.

The Variable Wiener Index of Trees with Given Maximum Degree

 The work is supported by Training and plan projects of college students' innovation and pioneering in Guangdong Province(No.1056412059). Abstract Wiener index proposed by Harold Wiener in 1947 is a very important topological index which is widely applied in chemical research. Gutman et al. extended the Wiener index to variable Wiener index. M. H. Liu et al. obtained the maximum variable Wiene...